Equational problems anddisunification
نویسندگان
چکیده
منابع مشابه
Equational Problems and Disunification
Roughly speaking, an equational problem is a first order formula whose only predicate symbol is =. We propose some rules for the transformation of equational problems and study their correctness in various models. Then, we give completeness results with respect to some “simple” problems called solved forms. Such completeness results still hold when adding some control which moreover ensures ter...
متن کاملOn the complexity of equational problems in CNF
Equational problems (i.e.: rst-order formulae with quantiier preex 9 8 , whose only predicate symbol is syntactic equality) are an important tool in many areas of Computer Science like automated deduction, automated model building, logic programming , functional programming, etc. The aim of this work is a complexity analysis of the satissability problem of equational problems over a nite domain...
متن کاملThe Complexity of Counting Problems in Equational Matching
We introduce a class of counting problems that arise naturally in equational matching and study their computational complexity. If E is an equational theory, then #E-Matching is the problem of counting the number of complete minimal E-matchers of two given terms. #E-Matching is a well-deened algorithmic problem for every nitary equational theory. Moreover, it captures more accurately the comput...
متن کاملSome Unsolved Problems between Lattice Theory and Equational Logic1
ly in their type lattice and defined as the unique member satisfying a first-order lattice formula Cp(x) , where (p depends of course on the theory to be defined by it. I conjecture: (12) all automorphisms of L(t) are basic ones, generated by exchanging operation symbols that have the same rank, and by permuting the "places" of some operation symbols; (13) every member of L(t) that is finitely ...
متن کاملHerbrand's Theorem and Equational Reasoning: Problems and Solutions
The famous Herbrand's theorem of mathematical logic plays an important role in automated theorem proving. In the rst part of this article, we recall the theorem and formulate a number of natural decision problems related to it. Somewhat surprisingly, these problems happen to be equivalent. One of these problems is the so-called simultaneous rigid E-uni cation problem. In the second part, we sur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1989
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(89)80017-3